Cellular Automata: Wolfram’s Metaphors for Complex Systems

نویسنده

  • Pratip Bhattacharyya
چکیده

In the late 1940’s while he was trying to construct a model for self-reproduction, a machine equivalent to biological systems, von Neumann invented a class of discrete mathematical systems called cellular automata [1]. Almost thirty years after the invention cellular automata underwent a radical reformation when, in the early 1980’s, Wolfram considered them as general mathematical representations of complex systems in nature [2, 3]. His investigations on cellular automata led him to the conviction that the laws for complex systems cannot be formulated as conventional mathematical equations; he proposed that the evolution of these systems can be correctly described only in the form of algorithms, the kind that are used in computer programs. It was the beginning of a new branch of science which Wolfram originally called the science of complexity. This new branch of science is based on the notion of computation [4]. According to Wolfram the evolution of any system, natural or artificial, can be viewed as a computation for which the initial state of the system is the input and the state that emerges after a given interval of time is the output. Cellular automata provided the ground for the discovery and the development of this new science.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Elementary Cellular Automata with a New Kind of Dynamic

Finite elementary cellular automata (ECAs) are studied, considering periodic and the four types of fixed boundary conditions. It is shown that two of these automata, rules 26 and 154, have particularly interesting dynamics. Both these rules are in Wolfram’s class 2 when subject to periodic boundary conditions but have chaotic dynamics, typical of Wolfram’s class 3, when we consider fixed bounda...

متن کامل

Information Flow in Cellular Automata

Long-time correlations between components of stochastic physical systems have been observed to be stronger than an exponential decay model would predict. Simple programs should likewise exhibit slow information dissipation at large t if they are to underlie statistical systems as Stephen Wolfram’s A New Kind of Science suggests. Here it is shown that information about the initial conditions of ...

متن کامل

Universality in Elementary Cellular Automata

The purpose of this paper is to prove that one of the simplest one dimensional cellular automata is computationally universal, implying that many questions concerning its behavior, such as whether a particular sequence of bits will occur, or whether the behavior will become periodic, are formally undecidable. The cellular automaton we will prove this for is known as “Rule 110” according to Wolf...

متن کامل

Predicting Cellular Automata

We explore the ability of a locally informed individual agent to predict the future state of a cell in systems of varying degrees of complexity using Wolfram’s onedimensional binary cellular automata. We then compare the agent’s performance to that of two small groups of agents voting by majority rule. We find stable rules (Class I) to be highly predictable, and most complex (Class IV) and chao...

متن کامل

Wolfram's Classification and Computation in Cellular Automata Classes III and IV

We conduct a brief survey on Wolfram’s classification, in particular related to the computing capabilities of Cellular Automata (CA) in Wolfram’s classes III and IV. We formulate and shed light on the question of whether Class III systems are capable of Turing universality or may turn out to be “too hot” in practice to be controlled and programmed. We show that systems in Class III are indeed c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004